Searching to Variable Depth in Computer Chess
نویسنده
چکیده
This paper discusses some methods for guiding the search of conventional chess programs to variable depth. The motivation for investigating such methods comes from the fact that searching to a fixed depth causes difficult problems (e.g. the horizon effect). The first section deals with certain improvements of the quiescence search and a demonstration of their beneficial effects. The method of not counting moves as a ply of depth is investigated then and the results of extending it somewhat are reported. As this method seems to be too simple nevertheless, a more general model tor extending the horizon of the full-width search to variable depth is proposed.
منابع مشابه
Searching for Chess
Chess programs have three major components: move generation, search, and evaluation. All components are important, although evaluation with its quiescence analysis is the part which makes each program's play unique. The speed of a chess program is a function of its move generation cost, the complexity of the position under study and the brevity of its evaluation. More important, however, is the...
متن کاملAuditory memory function in expert chess players
Background: Chess is a game that involves many aspects of high level cognition such as memory, attention, focus and problem solving. Long term practice of chess can improve cognition performances and behavioral skills. Auditory memory, as a kind of memory, can be influenced by strengthening processes following long term chess playing like other behavioral skills because of common processing pat...
متن کاملMassively Parallel Chess
Computer chess provides a good testbed for understanding dynamic MIMD-style computations. To investigate the programming issues, we engineered a parallel chess program called *Socrates, which running on the NCSA’s 512 processor CM-5, tied for third in the 1994 ACM International Computer Chess Championship. *Socrates uses the Jamboree algorithm to search game trees in parallel and uses the Cilk ...
متن کاملGiraffe: Using Deep Reinforcement Learning to Play Chess
This report presents Giraffe, a chess engine that uses self-play to discover all its domain-specific knowledge, with minimal hand-crafted knowledge given by the programmer. Unlike previous attempts using machine learning only to perform parametertuning on hand-crafted evaluation functions, Giraffe’s learning system also performs automatic feature extraction and pattern recognition. The trained ...
متن کاملAn Information Theoretic Analysis of Decision in Computer Chess
The basis of the method proposed in this article is the idea that information is one of the most important factors in strategic decisions, including decisions in computer chess and other strategy games. The model proposed in this article and the algorithm described are based on the idea of a information theoretic basis of decision in strategy games . The model generalizes and provides a mathema...
متن کامل